Levy Flight and Chaos Theory-Based Gravitational Search Algorithm for Global Optimization

The Gravitational Search Algorithm (GSA) is one of the highly regarded population-based algorithms. It has been reported that GSA a powerful global exploration capability but suffers from limitations getting stuck in local optima and slow convergence speed. In order to resolve aforementioned issues, modified version proposed based on levy flight distribution chaotic maps (LCGSA). LCGSA, diversification performed by utilizing high step size value while exploitation carried out maps. LCGSA tested well-known 23 classical benchmark functions. Moreover, it also applied three constrained engineering design problems. Furthermore, analysis results through various performance metrics like statistical measures, rate, so on. Also, signed Wilcoxon rank-sum test conducted. simulation indicate provides better as compared standard most competing